Performance Evaluation of a New Hardware Supported Multicast Scheme for -ary -cubes
نویسندگان
چکیده
In this paper, we propose a new hardware tree-based routing algorithm (HTA) for multicast communication under virtual cut-through switching in k-ary n-cubes that out-performs existing software and hardware path-based multicast routing schemes. Simulation results are compared against several commonly used multicast routing algorithms and show that HTA performs extremely well under many different conditions.
منابع مشابه
A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes
ÐMulticast communication is a key issue in almost all applications that run on any parallel architecture and, hence, efficient implementation of of multicast is critical to the performance of multiprocessor machines. Multicast is implemented in parallel architectures either via software or via hardware. Software-based approaches for implementing multicast can result in high message latencies, w...
متن کاملEecient Scatter Communication in Wormhole K-ary N-cubes with Multidestination Message Passing Eecient Scatter Communication in Wormhole K-ary N-cubes with Multidestination Message Passing 1
This paper presents eecient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the rst time in the literature, we demonstrate that multidestina-tion message-passing can also be used to support eecient personalize...
متن کاملDisha: A Performance Model of a True Fully Adaptive Routing Algorithm in k-Ary n-Cubes
A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerab...
متن کاملEecient Scatter Communication in Wormhole K-ary N-cubes with Multidestination Message Passing 1
This paper presents eecient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the rst time in the literature, we demonstrate that multidestina-tion message-passing can also be used to support eecient personalize...
متن کاملk-ary m-way Networks: the Dual of k-ary n-cubes
This article presents k-ary m-way networks, multidimensional mesh and tori networks that are viewed as the dual of k-ary n-cube networks. An m-way channel is the physical wiring of m router and processor links. An m-way router interfaces two channels only, irrespective of the network topology or dimension. This has important advantages: the same router can be used to build networks of different...
متن کامل